Propagating the Bin Packing Constraint Using Linear Programming
نویسندگان
چکیده
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow models, with the filtering of the bin packing constraint. Our experiments show that we often obtain significant improvements in runtime. The DP-flow model is a novel formulation of the problem.
منابع مشابه
A Survey on Scheduling and Optimization Techniques for Static Segment of FlexRay Protocol
FlexRay is getting popular among car makers to be used as a communication backbone for in-vehicle networking systems. It serves both time-triggered as well as event-triggered applications by maintaining static and dynamic segments in its communication cycle. There are many works on the scheduling of the signals that are motivated by different vehicular applications. In this survey the focus is ...
متن کاملUsing Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
T two-dimensional bin-packing problem is the problem of orthogonally packing a given set of rectangles into a minimum number of two-dimensional rectangular bins. The problem is -hard and very difficult to solve in practice as no good mixed integer programming (MIP) formulation has been found for the packing problem. We propose an algorithm based on the well-known Dantzig-Wolfe decomposition whe...
متن کاملBin Packing with Linear Usage Costs - An Application to Energy Management in Data Centres
EnergeTIC is a recent industrial research project carried out in Grenoble on optimizing energy consumption in data-centres. The efficient management of a data-centre involves minimizing energy costs while ensuring service quality. We study the problem formulation proposed by EnergeTIC. First, we focus on a key sub-problem: a bin packing problem with linear costs associated with the use of bins....
متن کاملBin Packing with Linear Usage Costs
Bin packing is a well studied problem involved in many applications. The classical bin packing problem is about minimising the number of bins and ignores how the bins are utilised. We focus in this paper, on a variant of bin packing that is at the heart of efficient management of data centres. In this context, servers can be viewed as bins and virtual machines as items. The efficient management...
متن کاملGeneral Arc-flow Formulation with Graph Compression
We present an exact method, based on an arc-flow formulation with side constraints, for solving bin packing and cutting stock problems — including multi-constraint variants — by simply representing all the patterns in a very compact graph. Our method includes a graph compression algorithm that usually reduces the size of the underlying graph substantially without weakening the model. Our formul...
متن کامل